Zero - Knowledge in the Hidden - Bits Model for the Graph Hamiltonian problem
نویسنده
چکیده
Definition 1 A Hamiltonian cycle in a graph is a cycle that visits each vertex exactly once. A Hamiltonian graph is a graph that contains a Hamiltonian cycle. It is well known that the problem of determining if a graph is Hamiltonian is N P-complete. Here we will construct a NIZK proof in the hidden-bits model (HBM) that is able to prove that a graph is Hamiltonian. First we define how graphs are represented as matrices.
منابع مشابه
On the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملGeometric-Arithmetic Index of Hamiltonian Fullerenes
A graph that contains a Hamiltonian cycle is called a Hamiltonian graph. In this paper we compute the first and the second geometric – arithmetic indices of Hamiltonian graphs. Then we apply our results to obtain some bounds for fullerene.
متن کاملA comprehensive model of hidden curriculum management in medical education
Introduction: Hidden curriculum plays a main role in professionallearning, formation of professional identity, socialization,moral development and learning values, attitudes, beliefs, andknowledge in learners, so it needs to be managed. Althoughthe majority of the theorists believe in the existence of a hiddencurriculum and its greater effect and sustainability com...
متن کاملA Novel Method for Selecting the Supplier Based on Association Rule Mining
One of important problems in supply chains management is supplier selection. In a company, there are massive data from various departments so that extracting knowledge from the company’s data is too complicated. Many researchers have solved this problem by some methods like fuzzy set theory, goal programming, multi objective programming, the liner programming, mixed integer programming, analyti...
متن کاملAn iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کامل